public class Test {
    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        Node root = binaryTree.createTree();
        System.out.print("前序遍历: ");
        binaryTree.preOrderTraversal(root);
        System.out.println();
        System.out.print("中序遍历：");
        binaryTree.inOrderTraversal(root);
        System.out.println();
        System.out.print("后序遍历： ");
        binaryTree.postOrderTraversal(root);
        System.out.println();
        System.out.println("高度："+binaryTree.getHeight(root));
        binaryTree.getSize1(root);
        System.out.println("节点个数："+binaryTree.size);
        int ret = binaryTree.getSize2(root);
        System.out.println("节点个数："+ret);
        int ret1 = binaryTree.getLeafSize2(root);
        System.out.println("叶子节点个数："+ret1);
        int ret2 = binaryTree.getKLevelSize(root,3);
        System.out.println("第K层节点个数："+ret2);
        Node ret3 = binaryTree.find(root,'B');
        System.out.println(ret3.val);
        System.out.println(binaryTree.isCompleteTree(root));
        binaryTree.levelOrderTraversal(root);

    }


}
